Trinity symmetry and kaleidoscopic regular maps
نویسندگان
چکیده
منابع مشابه
Trinity Symmetry and Kaleidoscopic Regular Maps
A cellular embedding of a connected graph (also known as a map) on an orientable surface has trinity symmetry if it is isomorphic to both its dual and its Petrie dual. A map is regular if for any two incident vertex-edge pairs there is an automorphism of the map sending the first pair onto the second. Given a map M with all vertices of the same degree d, for any e relatively prime to d the powe...
متن کاملRegular Surfaces and Regular Maps
A regular surface is a closed genus g surface defined as the tubular neighbourhood of the edge graph of a regular map. A regular map is a family of disc type polygons glued together to form a 2-manifold which is flag transitive. The visualization of this highly symmetric surface is an intriguing and challenging problem. Unlike regular maps, regular surfaces can always be visualized as 3D embedd...
متن کاملRegular Homomorphisms and Regular Maps
Regular homomorphisms of oriented maps essentially arise from a factorization by a subgroup of automorphisms. This kind of map homomorphism is studied in detail, and generalized to the case when the induced homomorphism of the underlying graphs is not valency preserving. Reconstruction is treated by means of voltage assignments on angles, a natural extension of the common assignments on darts. ...
متن کاملRegular Symmetry Patterns
Symmetry reduction is a well-known approach for alleviating the state explosion problem in model checking. Automatically identifying symmetries in concurrent systems, however, is computationally expensive. We propose a symbolic framework for capturing symmetry patterns in parameterised systems (i.e. an infinite family of finite-state systems): two regular word transducers to represent, respecti...
متن کاملFamilies of Regular Graphs in Regular Maps
The question of when a given graph can be the underlying graph of a regular map has roots a hundred years old and is currently the object of several threads of research. This paper outlines this topic briefly and proves that a product of graphs which have regular embeddings also has such an embedding. We then present constructions for members of three families: (1) circulant graphs, (2) wreath ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 2013
ISSN: 0002-9947,1088-6850
DOI: 10.1090/s0002-9947-2013-06079-5